| 1. | Finite automata model for one type of dna computing system
计算系统的有限自动机模型 |
| 2. | A feasible method for achieving finite automaton
有限自动机的类类型实现方法 |
| 3. | Minimize connective finite automata and its complexity
连接型自动机的极小化及其复杂性 |
| 4. | A finite automata model for optimistic contract signing protocols
乐观电子合同签订协议的一种有限状态机模型 |
| 5. | Alternating finite automaton
交替式有限状态自动机 |
| 6. | Tao rj . invertibility of finite automata . beijing : science press , 1979 ( in chinese )
陶仁骥.有限自动机的可逆性.北京:科学出版社, 1979 |
| 7. | So the storage structure of finite automaton should the choosed adjacency lists
所以，有穷自动机的存储结构最好采用邻接链表来存储。 |
| 8. | As discussed last month , i plan to use deterministic finite automaton to compile the proxy
如上个月所讨论的，我计划用确定性有限自动机（ deterministic finite automaton ， dfa ）来编译该代理。 |
| 9. | This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata
本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。 |
| 10. | Specifical , the main results are as follows : 1 . lattice - valued finite automata . we introduce the conpect of lattice - valued finite automata
本文主要采用了比较和类比、分析与综合、归纳、反证等研究方法。 |
